A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem
نویسندگان
چکیده
Methodology for the Capacitated Examination Timetabling Problem Salwani Abdullah, Samad Ahmadi, Edmund K. Burke, Moshe Dror and Barry McCollum 1 Automated Scheduling, Optimisation and Planning Research Group, School of Computer Science & Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, United Kingdom. School of Computing, De Montfort University, The Gateway, Leicester LE1 9BH, United Kingdom. MIS Department, College of Business and Public Administration, University of Arizona, Tucson, Arizona 85721, USA Department of Computer Science, Queen’s University Belfast, Belfast BT7 1NN, United Kingdom
منابع مشابه
A novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملA Tabu-based Memetic Approach to the Examination Timetabling Problem
Constructing examination timetable for higher educational institutions is a very complex work due to the complexity of timetabling problems. The objective of examination timetabling problem is to satisfy the hard constraints and minimize the violations of soft constraints. In this paper, a tabu-based memetic approach has been applied and evaluated against the latest methodologies in the literat...
متن کاملCapacitated Single Allocation P-Hub Covering Problem in Multi-modal Network Using Tabu Search
The goals of hub location problems are finding the location of hub facilities and determining the allocation of non-hub nodes to these located hubs. In this work, we discuss the multi-modal single allocation capacitated p-hub covering problem over fully interconnected hub networks. Therefore, we provide a formulation to this end. The purpose of our model is to find the location of hubs and the ...
متن کاملCompromise ratio with weighting functions in a Tabu Search multi-criteria approach to examination timetabling
University examination scheduling is a difficult and heavily administrative task, particularly when the number of students and courses is high. Changes in educational paradigms, an increase in the number of students, the aggregation of schools, more flexible curricula, among others, are responsible for an increase in the difficulty of the problem. As a consequence, there is a continuous demand ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- JORS
دوره 58 شماره
صفحات -
تاریخ انتشار 2007